Acceleration of a Two-grid Method for Eigenvalue Problems
نویسندگان
چکیده
This paper provides a new two-grid discretization method for solving partial differential equation or integral equation eigenvalue problems. In 2001, Xu and Zhou introduced a scheme that reduces the solution of an eigenvalue problem on a finite element grid to that of one single linear problem on the same grid together with a similar eigenvalue problem on a much coarser grid. By solving a slightly different linear problem on the fine grid, the new algorithm in this paper significantly improves the theoretical error estimate which allows a much coarser mesh to achieve the same asymptotic convergence rate. Numerical examples are also provided to demonstrate the efficiency of the new method.
منابع مشابه
Corrigendum to: "Acceleration of a two-grid method for eigenvalue problems"
This paper provides a new two-grid discretization method for solving partial differential equation or integral equation eigenvalue problems. In 2001, Xu and Zhou introduced a scheme that reduces the solution of an eigenvalue problem on a finite element grid to that of one single linear problem on the same grid together with a similar eigenvalue problem on a much coarser grid. By solving a sligh...
متن کاملSome new restart vectors for explicitly restarted Arnoldi method
The explicitly restarted Arnoldi method (ERAM) can be used to find some eigenvalues of large and sparse matrices. However, it has been shown that even this method may fail to converge. In this paper, we present two new methods to accelerate the convergence of ERAM algorithm. In these methods, we apply two strategies for the updated initial vector in each restart cycles. The implementation of th...
متن کاملA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملOn a Multilevel Krylov Method for the Helmholtz Equation Preconditioned by Shifted Laplacian
In Erlangga and Nabben [SIAM J. Sci. Comput., 30 (2008), pp. 1572–1595], a multilevel Krylov method is proposed to solve linear systems with symmetric and nonsymmetric matrices of coefficients. This multilevel method is based on an operator which shifts some small eigenvalues to the largest eigenvalue, leading to a spectrum which is favorable for convergence acceleration of a Krylov subspace me...
متن کاملTwo-grid Discretization Schemes of the Nonconforming Fem for Eigenvalue Problems
This paper extends the two-grid discretization scheme of the conforming finite elements proposed by Xu and Zhou (Math. Comput., 70 (2001), pp.17-25) to the nonconforming finite elements for eigenvalue problems. In particular, two two-grid discretization schemes based on Rayleigh quotient technique are proposed. By using these new schemes, the solution of an eigenvalue problem on a fine mesh is ...
متن کامل